package com.example.leetcode;

public class Solution {
    public int reverse(int x) {
        int y=0;
        for (int i=1;i<x+"".length();i++){
        }
        return y;
    }
}
